Cycle connectivity in weighted graphs
نویسندگان
چکیده
منابع مشابه
Some new connectivity parameters for weighted graphs
In this paper, the concepts of Wiener index of a vertex weighted and edge weighted graphs are discussed. Vertex weight and edge weight of a clique are introduced. Wiener index of a vertex weighted partial cube is also discussed. Also a new concept known as Connectivity index is introduced. A relation between Connectivity index and Wiener index for different graphs are discussed.
متن کاملAlgebraic Connectivity Under Site Percolation in Finite Weighted Graphs
We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the (augmented) Laplacian of the percolated graph concentrates around its expectation. This concentration bound then provides a lower bound on the algebraic connecti...
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملLocal connectivity and cycle xtension in claw-free graphs
Let G be a connected claw-free graph, M (G) the set of all vertices of G that have a connected neighborhood, and hM (G)i the induced subgraph of G on M (G). We prove that (i) if M (G) dominates G and hM (G)i is connected, then G is vertex pan-cyclic orderable, (ii) if M (G) dominates G; hM (G)i is connected, and G n M (G) is triangle-free, then G is fully 2-chord extendable, (iii) if M (G) domi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2011
ISSN: 0716-0917
DOI: 10.4067/s0716-09172011000100001